Modeling the genetic algorithm by a nonhomogeneous Markov chain: weak and strong ergodicity
نویسندگان
چکیده
منابع مشابه
On $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کاملErgodicity of Strong Markov Processes
We derive sufficient conditions for subgeometric f -ergodicity of strongly Markovian processes. We first propose a criterion based on modulated moment of some delayed return-time to a petite set. We then formulate a criterion for polynomial f -ergodicity in terms of a drift condition on the generator. Applications to specific processes are considered, including Langevin tempered diffusions on R...
متن کاملon $l_1$-weak ergodicity of nonhomogeneous continuous-time markov processes
in the present paper we investigate the $l_1$-weak ergodicity of nonhomogeneous continuous-time markov processes with general state spaces. we provide a necessary and sufficient condition for such processes to satisfy the $l_1$-weak ergodicity. moreover, we apply the obtained results to establish $l_1$-weak ergodicity of quadratic stochastic processes.
متن کاملStrong solutions and weak-strong uniqueness for the nonhomogeneous Navier-Stokes system
This article is devoted to the study of the nonhomogeneous incompressible NavierStokes system in dimension d ≥ 3. We use new a priori estimates, that enable us to deal with low-regularity data and vanishing density. In particular, we prove new well-posedness results that improve the results of Danchin [6] by considering a less regular initial density, without a lower bound. Also, we obtain the ...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Теория вероятностей и ее применения
سال: 2012
ISSN: 0040-361X
DOI: 10.4213/tvp4440